A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog? T. Str¨ oder1 , F. Emmes1 , P. Schneider-Kamp2 , J. Giesl1 , and C. Fuhs1 1

Source URL: www.dcs.bbk.ac.uk

Aachen Department of Computer Science Technical Report A Linear Operational Semantics for Termination and Complexity Analysis

Source URL: www.dcs.bbk.ac.uk

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

Source URL: www.dcs.bbk.ac.uk

• Theoretical computer science
• Computing
• Software engineering
• Logic in computer science
• Automated theorem proving
• Static program analysis
• Termination analysis
• Rewriting
• KeY
• Automated reasoning
• Bytecode
• Christoph Walther

Aachen Department of Computer Science Technical Report Better termination proving through cooperation

Source URL: sunsite.informatik.rwth-aachen.de

• Graph theory
• Mathematics
• Discrete mathematics
• Static program analysis
• Termination analysis
• Graph
• Cograph
• KeY
• IP
• Ear decomposition

Aachen Department of Computer Science Technical Report Automated Termination Analysis for Programs with Pointer Arithmetic

Source URL: sunsite.informatik.rwth-aachen.de

• Software
• Compilers
• LLVM

All-Termination(T) Aaron Turon Northeastern University (joint work with Pete Manolios)

Source URL: www.mpi-sws.org

• Software engineering
• Computer programming
• Computing
• Data types
• Functional programming
• Abstract data types
• Recursion
• Subroutines
• Theoretical computer science
• Cons
• List
• Termination analysis

All-Termination(T )? Panagiotis Manolios and Aaron Turon Northeastern University {pete,turon}@ccs.neu.edu Abstract. We introduce the All-Termination(T ) problem: given a termination solver T and a collection of functions

Source URL: www.mpi-sws.org

• Mathematical analysis
• Mathematics
• Analysis
• Functions and mappings
• Static program analysis
• Termination analysis
• Limit of a function
• IP
• Well-founded relation
• Measure theory
• Computability theory
• Inequalities

Under consideration for publication in Theory and Practice of Logic Programming 1 SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers∗

Source URL: www.dcs.bbk.ac.uk

• Mathematics
• Multiset
• Set
• Path ordering
• Theoretical computer science
• Computing

All-Termination(SCP) Panagiotis Manolios and Aaron Turon Northeastern University {pete,turon}@ccs.neu.edu Abstract. We recently introduced the All-Termination(T ) problem: given a termination solver T and a function F ,

Source URL: www.mpi-sws.org

• Mathematical analysis
• Mathematics
• Analysis
• Functions and mappings
• Computability theory
• Static program analysis
• Termination analysis
• Big O notation
• Derivative
• Bijection
• Expected value
• Recursion

SAT Instances for Termination Analysis with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

Source URL: www.dcs.bbk.ac.uk

• Theoretical computer science
• Logic in computer science
• Formal languages
• Hans Zantema
• International Conference on Rewriting Techniques and Applications
• Rewriting
• Termination analysis
• Divergence
• NP-completeness